翻訳と辞書 Words near each other ・ Full Moon Press (disambiguation) ・ Full Moon Productions ・ Full custom ・ Full cycle ・ Full Dark, No Stars ・ Full depth recycling ・ Full Devil Jacket ・ Full Diesel ・ Full disclosure ・ Full Disclosure (2001 film) ・ Full Disclosure (2005 film) ・ Full disclosure (computer security) ・ Full disclosure (mailing list) ・ Full Disclosure (The West Wing) ・ Full documentation loan ・ Full Domain Hash ・ Full Dress ・ Full dress ・ Full Eclipse ・ Full employment ・ Full Employment Abandoned ・ Full Employment Act ・ Full Employment in a Free Society ・ Full employment theorem ・ Full English (TV series) ・ Full Experience (album) ・ Full face diving mask ・ Full Faith and Credit Clause ・ Full Fat ・ Full Fat (EP) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Full Domain Hash ： ウィキペディア英語版 Full Domain Hash In cryptography, the Full Domain Hash (FDH) is an RSA-based signature scheme that follows the ''hash-and-sign'' paradigm. It is provably secure (i.e., is existentially unforgeable under adaptive chosen-message attacks) in the random oracle model. FDH involves hashing a message using a function whose image size equals the size of the RSA modulus, and then raising the result to the secret RSA exponent. ==Exact security of full domain hash== In the random oracle model, if RSA is $(t\text{'},\backslash epsilon\text{'})$-secure, then the full domain hash RSA signature scheme is $(t,\backslash epsilon)$-secure where, $t=t\text{'}-(q\_+q\_+1)\; \backslash cdot\; \backslash mathcal(k^3)$ and $\backslash epsilon\; =\; \backslash left(1+\backslash frac+1\}\; \backslash cdot\; q\_\; \backslash cdot\; \backslash epsilon\text{'}$. For large $q\_$ this boils down to $\backslash epsilon\; \backslash sim\; exp(1)\backslash cdot\; q\_\; \backslash cdot\; \backslash epsilon\text{'}$. This means that if there exists an algorithm that can forge a new FDH signature that runs in time ''t'', computes at most $q\_$ hashes, asks for at most $q\_$ signatures and succeeds with probability $\backslash epsilon$, then there must also exist an algorithm that breaks RSA with probability $\backslash epsilon\text{'}$ in time $t\text{'}$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Full Domain Hash」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.